Voronoi strains - a spline path planning algorithm for complex environments
نویسندگان
چکیده
Path planning and obstacle avoidance methods are often required for robots working in more and more complicated environments. This paper introduces a novel approach called Voronoi Strains for solving this task. The algorithm applies particle swarm optimization of cubic splines which are connected to strings. The initialization of the evolutionary algorithm is based on the Voronoi graph method as well as on strains of bacteria. Strains whose evolution is stuck in a dead end because of a local optimum die off. Only the strain located close to the global optimum or the biggest local optimum will survive the evolutionary process. Different settings of PSO parameters have been tested in various simulation experiments. The Voronoi Strains approach was also compared with other PSO methods using a different kind of initialization.
منابع مشابه
Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملStudy of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کاملInteractive Motion Planning Using Hardware - AcceleratedComputation of Generalized Voronoi
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram computation are applicable to both static and dynamic environments of fairly high complexity. We compute a discrete Voronoi diagram by rendering a three-dimensional distance mesh for each Voronoi site. The sites can be...
متن کاملA voronoi diagram-visibility graph-potential field compound algorithm for robot path planning
Numerous methods have been developed to solve the motion planning problem, among which the Voronoi diagram, visibility graph, and potential fields are well-known techniques. In this paper, a new path planning algorithm is presented where these three methods are integrated for the first time in a single architecture. After constructing the generalized Voronoi diagram of C-space, we introduce a n...
متن کاملHierarchical spline path planning method for complex environments
Path planning and obstacle avoidance algorithms are requested for robots working in more and more complicated environments. Standard methods usually reduce these tasks to the search of a path composed from lines and circles or the planning is executed only with respect to a local neighborhood of the robot. Sophisticated techniques allow to find more natural trajectories for mobile robots, but a...
متن کامل